Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms
نویسندگان
چکیده
منابع مشابه
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
We consider the RMS-distance (sum of squared distances between pairs of points) under translation between two point sets in the plane. In the Hausdorff setup, each point is paired to its nearest neighbor in the other set. We develop algorithms for finding a local minimum in near-linear time in the line, and in nearly quadratic time in the plane. These improve substantially the worst-case behavi...
متن کاملPartial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms
We consider the RMS distance (sum of squared distances between pairs of points) under translation between two point sets in the plane, in two different setups. In the partial-matching setup, each point in the smaller set is matched to a distinct point in the bigger set. Although the problem is not known to be polynomial, we establish several structural properties of the underlying subdivision o...
متن کاملOn Bipartite Matching under the RMS Distance
Given two sets A and B of n points each in R, we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. We can compute an optimal matching in O(n2+δ) time, for any δ > 0, and an ε-approximation in time O((n/ε)3/2 log n). If the set B is allowed to move rigidly to minimize the rms distance, we can compute a rigid motion of B...
متن کاملPartial Curve Matching under the Fréchet Distance∗
Curve matching is a fundamental problem which occurs in many applications. In this paper, we extend the Fréchet distance to measure partial curve similarity, study its properties, and develop efficient algorithms to compute it. In particular, under the L1 or L∞ metrics, we present an algorithm to compute, in O(m2) time, the partial Fréchet distance between a segment and a polygonal curve of siz...
متن کاملPartial Matching of Planar Polygons Under Translation and Rotation
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model-based object recognition. There are a variety of measures and algorithmic approaches used to address the curve matching problem including: shape signature strings with substring matching, geometric hashing, and Hausdo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0326-0